quotient filter造句

• A quotient filter has the usual AMQ operations of insert and query.
• The space used by quotient filters is comparable to that of Bloom filters.
• By construction the values in a quotient filter are stored in sorted order.
• Quotient filters are AMQs and, as such, provide many of the same benefits as Bloom filters.
• However quotient filters can be efficiently merged within memory without having to re-insert the original keys.
• An essential property of quotient filters is that they can be efficiently merged without having to re-insert the original keys.
• A query on the SAMT is directed at only select Wanna-" B "-trees as evidenced by their quotient filters.
• A typical application for quotient filters, and other AMQ filters, is to serve as a proxy for the keys in a database on disk.
• Similarly, we can halve or double the size of a quotient filter without rehashing the keys since the fingerprints can be recomputed using just the quotients and remainders.
• Any lookup will first consult the fast quotient filter, then look in the ( presumably much slower ) database only if the quotient filter reported the presence of the key.
• Any lookup will first consult the fast quotient filter, then look in the ( presumably much slower ) database only if the quotient filter reported the presence of the key.
• Merging two quotient filters is then a simple matter of converting each quotient filter into such a list, merging the two lists and using it to populate a new larger quotient filter.
• Merging two quotient filters is then a simple matter of converting each quotient filter into such a list, merging the two lists and using it to populate a new larger quotient filter.
• Merging two quotient filters is then a simple matter of converting each quotient filter into such a list, merging the two lists and using it to populate a new larger quotient filter.
• A "'quotient filter "', introduced by Bender " et al . " in 2011, is a space-efficient probabilistic data structure used to test whether an false positive ).
• The storage system in its normal operation compacts the SAMT's Wanna-" B "-trees, merging smaller Wanna-" B "-trees into larger ones and merging their quotient filters.